Cycle decomposition by disjoint transpositions
نویسندگان
چکیده
منابع مشابه
Searching Cycle-Disjoint Graphs
In this paper, we consider the edge searching problem on cycle-disjoint graphs. We first improve the running time of the algorithm to compute the vertex separation and the optimal layout of a unicyclic graph, which is given by Ellis et al. (2004), from O(n log n) to O(n). By a linear-time transformation, we can compute the edge search number of a unicyclic graph in linear time. We also propose ...
متن کاملSorting by Weighted Reversals, Transpositions, and Inverted Transpositions
During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chromosome (like mitochondrial, chloroplast, or bacterial genomes), the biologically relevant genome rearrangements are (1) inversions--also called reversals--where a section of the genome is excised, reversed in orientation, and re...
متن کاملSorting by Transpositions
Sequence comparison in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e., insertions, deletions, and substitutions of nucleotides) and ignore global rearrangements (i.e., inversions and transpositions of long fragments). As a result, the applications o...
متن کاملThe Sign of a Permutation
This is not the only way to write (abc) using transpositions, e.g., (abc) = (bc)(ac) = (ac)(ab). Since any permutation in Sn is a product of cycles and any cycle is a product of transpositions, any permutation in Sn is a product of transpositions. 1 Unlike the unique decomposition of a permutation into a product of disjoint cycles, the decomposition of a permutation as a product of transpositio...
متن کاملGenerating Binary Trees by Transpositions
Let T(n) denote the set of all bitstrings with n 1's and n 0's that satisfy the property that in every preex the number of 0's does not exceed the number of 1's. This is a well known representation of binary trees. We consider algorithms for generating the elements of T(n) that satisfy one of the following constraints: (a) successive bitstrings diier by the transposition of two bits, or (b) suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1972
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90010-6